Completeness – I. Revisited, reviewed and revived
نویسندگان
چکیده
منابع مشابه
Completeness I : revisited , reviewed and revived
We have extended and improved the statistical test recently developed by Rauzy for assessing the completeness in apparent magnitude of magnitude-redshift surveys. Our improved test statistic retains the robust properties – specifically independence of the spatial distribution of galaxies within a survey – of the Tc statistic introduced in Rauzy’s seminal paper, but now accounts for the presence...
متن کاملKripke completeness revisited
The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for...
متن کاملDenotational Completeness Revisited
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.
متن کاملModularity of Completeness Revisited
One of the key results in the eld of modularity for Term Rewriting Systems is the modularity of completeness for left linear TRSs established by Toyama Klop and Barendregt in TKB The proof however is quite long and involved In this paper a new proof of this basic result is given which is both short and easy employing the powerful technique of pile and delete already used with success in proving...
متن کاملCompleteness in Two-Party Secure Computation Revisited
A Secure Function Evaluation (SFE) of a two-variable function f(·, ·) is a protocol that allows two parties with inputs x and y to evaluate f(x, y) in a manner where neither party learns “more than is necessary”. A rich body of work deals with the study of completeness for secure two-party computation. A function f is complete for SFE if a protocol for securely evaluating f allows the secure ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 2007
ISSN: 0035-8711,1365-2966
DOI: 10.1111/j.1365-2966.2007.11559.x